Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time
نویسنده
چکیده
Lei G = (VI A) be a directed, planar graph, let s , t E V, s # t , and let c, > 0 be the capacity of an arc a E A. The problem is i o find a maximum pow from s to t in G subject to these capacities. The fastest algorithm known so far requires O(lV\. m . l o g J V J ) iime, whereas the algorithm introduced in this paper requires only O(lVl log IVl) time.
منابع مشابه
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in an undirected planar EVC-network to the minimum edge-cut problem in another planar network with edge capacity only (EC-network), thus the minimum-cut or the maximum flow value can be computed in O(n log n) time. Based on this r...
متن کاملFree multiflows in bidirected and skew-symmetric graphs
A graph (digraph) G = (V,E) with a set T ⊆ V of terminals is called inner Eulerian if each nonterminal node v has even degree (resp. the numbers of edges entering and leaving v are equal). Cherkassky [1] and Lovász [15] showed that the maximum number of pairwise edge-disjoint T -paths in an inner Eulerian graph G is equal to 1 2 ∑ s∈T λ(s), where λ(s) is the minimum number of edges whose remova...
متن کاملA Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Given a graph G V E and two vertices s t V s t the Menger problem is to nd a maximum number of disjoint paths connecting s and t Depending on whether the input graph is directed or not and what kind of disjointness criterion is demanded this general formulation is specialized to the directed or undirected vertex and the edge or arc disjoint Menger problem respectively For planar graphs the edge...
متن کاملA Linear Time Algorithm for the Arc Disjoint Menger Problemin Planar Directed
Given a graph G = (V; E) and two vertices s; t 2 V , s 6 = t, the Menger problem is to nd a maximum number of disjoint paths connecting s and t. Depending on whether the input graph is directed or not, and what kind of disjointness criterion is demanded, this general formulation is specialized to the directed or undirected vertex, and the edge or arc disjoint Menger problem, respectively. For p...
متن کاملA Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs1
Given a graph G = (V, E) and two vertices s, t ∈ V , s 6= t , the Menger problem is to find a maximum number of disjoint paths connecting s and t . Depending on whether the input graph is directed or not, and what kind of disjointness criterion is demanded, this general formulation is specialized to the directed or undirected vertex, and the edge or arc disjoint Menger problem, respectively. Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994